int fib(int a) {
  int arr[100];
  arr[0] = 1;
  arr[1] = 1;
  int i = 0;
  while(i != a + 1) {
    if(i == 0) {
      i = i + 1;
      continue;
    }
    if(i == 1) {
      i = i + 1;
      continue;
    }
    arr[i] = arr[i-1] + arr[i-2];
    i = i+1;
  }
  return arr[a];
}
int main() {
  return fib(2);
}
